High-Performance Annotation Tagging over Solr Full-text Indexes

7. Full-Text Indexes in External Memory

A full-text index is a data structure storing a text (a string or a set of strings) and supporting string matching queries: Given a pattern string P , find all occurrences of P in the text. The best-known full-text index is the suffix tree [761], but numerous others have been developed. Due to their fast construction and the wealth of combinatorial information they reveal, full-text indexes (an...

Full Automatic Arabic Text Tagging System

Part-of-Speech tagging is the process of assigning grammatical part-of-speech tags to words based on their context. Many automated tagging systems have been developed for English and many other western languages, and for some Asian languages, and have achieved accuracy rates ranging from 95% to 98%. A tagged corpus has more useful information than untagged corpus; so, tagged corpus can be used ...

Space-efficient Genome Comparisons with Compressed Full-text Indexes

Optimizing Generalized Path Expressions Using Full Text Indexes

Query languages for object bases became enriched by generalized path expressions that allow for attribute and path variables. Optimizing queries containing generalized path expressions attracted some interest. However, many interesting queries require still a full scan over the whole object base. This unbearable situation can be remedied best by utilizing index structures. However, traditional ...

Full-text and Keyword Indexes for String Searching

String searching consists in locating a substring in a longer text, and two strings can be approximately equal (various similarity measures such as the Hamming distance exist). Strings can be defined very broadly, and they usually contain natural language and biological data (DNA, proteins), but they can also represent other kinds of data such as music or images. One solution to string searchin...